Saddle-point optimality criteria of continuous time programming without differentiability
نویسندگان
چکیده
منابع مشابه
Nonsmooth interval-valued optimization and saddle-point optimality criteria
In this article, we focus our attention on a nonsmooth interval-valued optimization problem and establish sufficient optimality conditions for a feasible solution to be a LU optimal solution under the invexity assumption. Appropriate duality theorems for Wolfe and Mond-Weir type duals are presented in order to relate the LU optimal solution of primal and dual programs. Moreover, saddle-point ty...
متن کاملLagrange multipliers theorem and saddle point optimality criteria in mathematical programming
We prove a version of Lagrange multipliers theorem for nonsmooth functionals defined on normed spaces. Applying these results, we extend some results about saddle point optimality criteria in mathematical programming. © 2005 Elsevier Inc. All rights reserved.
متن کاملContinuous-time Markov decision processes with nth-bias optimality criteria
In this paper, we study the nth-bias optimality problem for finite continuous-time Markov decision processes (MDPs) with a multichain structure. We first provide nth-bias difference formulas for two policies and present some interesting characterizations of an nth-bias optimal policy by using these difference formulas. Then, we prove the existence of an nth-bias optimal policy by using nth-bias...
متن کاملSaddle Point Optimality Conditions in Fuzzy Optimization Problems
The Karush–Kuhn–Tucker (KKT) optimality conditions and saddle point optimality conditions in fuzzy programming problems have been studied in literature by various authors under different conditions. In this paper, by considering a partial order relation on the set of fuzzy numbers, and convexity with differentiability of fuzzy mappings, we have obtained the Fritz John (FJ) constraint qualificat...
متن کاملSaddle Point Criteria and Duality in Multiobjective Programming via an Η-approximation Method
In this paper, Antczak’s -approximation approach is used to prove the equivalence between optima of multiobjective programming problems and the -saddle points of the associated -approximated vector optimisation problems. We introduce an -Lagrange function for a constructed -approximated vector optimisation problem and present some modified -saddle point results. Furthermore, we construct an -ap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1977
ISSN: 0022-247X
DOI: 10.1016/0022-247x(77)90072-5